Practical Bijective S-box Design
نویسندگان
چکیده
Vectorial Boolean functions are usually called Substitution Boxes (S-Boxes) and are used as basic component of block ciphers in Cryptography. The ciphers that are Substitution-permutation networks use bijective S-Boxes i.e., Boolean permutations. S-Boxes with low differential uniformity and high nonlinearity are considered as cryptographically strong. In this paper we study some properties of S-Boxes. We construct 8× 8 bijective cryptographically strong S-Boxes. Our construction is based on using non-bijective power functions over the finite field.
منابع مشابه
PICARO - A Block Cipher Allowing Efficient Higher-Order Side-Channel Resistance
Many papers deal with the problem of constructing an efficient masking scheme for existing block ciphers. We take the reverse approach: that is, given a proven masking scheme (Rivain and Prouff, CHES 2010) we design a block cipher that fits well the masking constraints. The difficulty of implementing efficient masking for a block cipher comes mainly from the S-boxes. Therefore the choice of an ...
متن کاملComparison of Random S-box Generation Methods
Random bijective S-box generation methods are considered. An alternative S-box generation method by forming compositions of permutations from some fixed set is proposed. Experiments show that the rate of acceptable S-boxes for all the methods considered is essentially the same. The advantage of the composition method is an obvious parametrization, with the potentially large key space.
متن کاملOn the Design of Linear Transformations for Substitution Permutation Encryption Networks
In this paper we study the security of Substitution Permutation Encryption Networks (SPNs) with randomly selected bijective substitution boxes and a randomly selected invertible linear transformation layer. In particular, our results show that for such a 64–bit SPN using 8 8 s-boxes, the number of s-boxes involved in any 2 rounds of a linear approximation or a differential characteristic is equ...
متن کاملImproved Rijndael-Like S-Box and Its Transform Domain Analysis
In this paper, we propose a simple scheme which produces a new S-box from a given S-box. We use the well-known conversion technique between the polynomial functions over F2n and the boolean functions from F2 to F2. We have applied the scheme to Rijndael S-box and obtained 29 new S-boxes, of which only one is a bijection with better algebraic expression than the original Rijndael S-box and has t...
متن کاملCryptanalysis of Symmetric Block Ciphers Based on the Feistel Network with Non-bijective S-boxes in the Round Function
We consider ciphertext-only attack on symmetric block ciphers based on the Feistel network with secret S-boxes installed as an additional parameter, like in Soviet GOST 28147-89. In case when Sboxes are generated by authorized agency and cannot be verified by end-user of the cipher (e.g., in case of special equipment for encryption), application of non-bijective S-boxes allows significantly dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1301.4723 شماره
صفحات -
تاریخ انتشار 2009